ZHENG, Xinhu - HKUST Class Schedule & Quota

Class Schedule & Quota
2025-26 Spring 2025-26 Winter 2025-26 Fall 2024-25 Summer
2025-26 Spring
Common Core Course
The class information on this page will normally be updated every 15 to 20 minutes during class enrollment period.
» Student Information System (SIS)» PG Program/Course Catalog
Notes & Links
This service was first adapted from a student contribution in 2011-12 Fall. The efforts of all concerned are duly acknowledged.

AIAA AMAT BSBE CMAA CNCC CNGF DLED DSAA EOAS FTEC FUNH INFH INTR IOTA IPEN LANG MICS MSSM PDEV PLED ROAS SEEN SMMG SOCH SYSH UCMP UCUG UFUG UGOD

COURSE INFO

VECTOR	[3-0-0:3]
DESCRIPTION	Intelligent connected vehicles (ICVs) are believed to change people’s life in the near future by making the transportation safer, cleaner and more comfortable. Although many prototypes of ICVs have been developed to prove the concept of autonomous driving and the feasibility of improving traffic efficiency, there still exists a significant gap before achieving mass production of high-level ICVs. This course aims to present an overview of both the state of the art and future perspectives of key technologies that are needed for future ICVs. Through the study of this course, students will understand and master the basic concepts, key technologies and applications of ICV, and initially learn and master the ability to use that knowledge to solve practical problems, especially in cross-disciplinary communication and transportation context.

VECTOR

[3-0-0:3]

DESCRIPTION

Intelligent connected vehicles (ICVs) are believed to change people’s life in the near future by making the transportation safer, cleaner and more comfortable. Although many prototypes of ICVs have been developed to prove the concept of autonomous driving and the feasibility of improving traffic efficiency, there still exists a significant gap before achieving mass production of high-level ICVs. This course aims to present an overview of both the state of the art and future perspectives of key technologies that are needed for future ICVs. Through the study of this course, students will understand and master the basic concepts, key technologies and applications of ICV, and initially learn and master the ability to use that knowledge to solve practical problems, especially in cross-disciplinary communication and transportation context.

INTR 5240 - The Principle and Application of Intelligent Connected Vehicle (3 units)

Section	Date & Time	Room	Instructor	Quota	Enrol	Avail	Wait	Remarks
L01 (6142)	Mo 09:00AM - 11:50AM	Rm 102, E1	ZHENG, Xinhu	30	0	30	0

[Matching between Lecture & Tutorial required]

COURSE INFO

PRE-REQUISITE	UFUG 1103 OR UFUG 1106
EXCLUSION	UFUG 2102
DESCRIPTION	Linear algebra is central to almost all areas of mathematics and is also used in most sciences and fields of engineering. This course provides a comprehensive introduction to topics of linear algebra studies, including linear systems, vector spaces, matrices, linear mappings and matrix forms, inner products, orthogonality and Gram-Schmidt process, eigenvalues and eigenvectors, symmetric matrices and diagonalization, and determinants.

UFUG 2103 - Linear Algebra (3 units)

Section	Date & Time	Room	Instructor	Quota	Enrol	Avail	Wait	Remarks
L06 (6637)	WeFr 03:00PM - 04:20PM	Rm 148, E1	ZHENG, Xinhu	60	0	60	0
T06 (6638)	Fr 06:00PM - 06:50PM	Rm 148, E1	ZHENG, Xinhu	60	0	60	0

COURSE INFO

PRE-REQUISITE	UFUG 1601
DESCRIPTION	This course introduces common data structures and algorithms. Data structures include arrays and matrices, linked lists, stacks, priority queues, hash tables, trees, and graphs. Algorithms include sorting, hashing, searching, greedy methods, divide-and-conquer, dynamic programming, and branch-and-bound. Students will learn Python implementations of these data structures and algorithms, and solve programming problems with learned techniques.

PRE-REQUISITE

UFUG 1601

DESCRIPTION

This course introduces common data structures and algorithms. Data structures include arrays and matrices, linked lists, stacks, priority queues, hash tables, trees, and graphs. Algorithms include sorting, hashing, searching, greedy methods, divide-and-conquer, dynamic programming, and branch-and-bound. Students will learn Python implementations of these data structures and algorithms, and solve programming problems with learned techniques.

UFUG 2602 - Data Structure and Algorithm Design (3 units)

Section	Date & Time	Room	Instructor	Quota	Enrol	Avail	Wait	Remarks
L02 (6684)	Mo 01:30PM - 02:50PM	Rm 101, W4	ZHENG, Xinhu	48	0	48	0
L02 (6684)	We 01:30PM - 02:50PM	Rm 101, E4	ZHENG, Xinhu	48	0	48	0